- reducible theory
- мат.сводимая теория
English-Russian scientific dictionary. 2008.
reducible theory
Смотреть что такое "reducible theory" в других словарях:
Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Representation theory — This article is about the theory of representations of algebraic structures by linear transformations and matrices. For the more general notion of representations throughout mathematics, see representation (mathematics). Representation theory is… … Wikipedia
Critical theory — Horkheimer, Adorno, Habermas David Rasmussen HEGEL, MARX AND THE IDEA OF A CRITICAL THEORY Critical theory1 is a metaphor for a certain kind of theoretical orientation which owes its origin to Hegel and Marx, its systematization to Horkheimer and … History of philosophy
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia
Deligne–Lusztig theory — In mathematics, Deligne–Lusztig theory is a way of constructing linear representations of finite groups of Lie type using ℓ adic cohomology with compact support, introduced by Deligne Lusztig (1976). Lusztig (1984) used these representations to… … Wikipedia
Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… … Wikipedia
Representation theory of SL2(R) — In mathematics, the main results concerning irreducible unitary representations of the Lie group SL2(R) are due to Gelfand and Naimark (1946), V. Bargmann (1947), and Harish Chandra (1952). Structure of the complexified Lie algebra We choose a… … Wikipedia
Representation theory of the Poincaré group — In mathematics, the representation theory of the double cover of the Poincaré group is an example of the theory for a Lie group, in a case that is neither a compact group nor a semisimple group. It is important in relation with theoretical… … Wikipedia
